Eecient Solutions for Mapping Parallel Programs
نویسنده
چکیده
A faire apr es
منابع مشابه
Eecient Solutions for Mapping Parallel Programs ?
This paper describes a mapping toolbox, whose aim is to optimize the execution time of parallel programs described as task graphs on distributed memory parallel systems. The toolbox includes several classical mapping algorithms. It was assessed by computing the mapping of randomly generated task graphs and by mapping and executing on a parallel system synthetic programs representing some classi...
متن کاملMapping a Functional Notation for Parallel Programs Onto Hypercubes
The theory of powerlists was recently introduced by Jayadev Misra 7]. Powerlists can be used to specify and verify certain parallel algorithms, using a notation similar to functional programming languages. In contrast to sequential languages the powerlist notation has constructs for expressing balanced divisions of lists. We study how Preex Sum, a fundamental parallel algorithm, can be tailored...
متن کاملDivide-and-conquer mapping of parallel programs onto hypercube computers
Mapping of parallel programs onto parallel computers for eecient execution is a fundamental problem of great signiicance in parallel processing. This paper describes a heuristic algorithm for mapping arbitrary parallel programs onto hypercube computers using a divide-and-conquer technique. The running time of our algorithm is O(dn 3), where n is the number of tasks in the parallel program and d...
متن کاملTransformation Based Development of Eecient Programs for Massively Parallel Architectures
This paper presents a methodology that is used to detect predeened algorithmic structures (skeletons) in a ne granular program speciication. For each skeleton the best mapping on a particular massively parallel system is known. The skeleton identiication process helps in making good mapping decisions.
متن کاملDerivation of Eecient Data Parallel Programs
This paper considers the expression and derivation of eecient data parallel programs for SIMD and MIMD machines. It is shown that eecient parallel programs must utilise both sequential and parallel computation; these are termed hybrid programs. The Bird{Meertens formalism, a calculus of higher order functions, is used to derive and express programs. Our goal is to derive eecient parallel progra...
متن کامل